Robust Optimization via Probabilistic Cutting Plane Technique
نویسندگان
چکیده
منابع مشابه
A Cutting-Plane Alternating Projections Algorithm A Cutting-Plane, Alternating Projections Algorithm for Conic Optimization Problems
We introduce a hybrid projection-localization method for solving large convex cone programs. The method interleaves a series of projections onto localization sets with the classical alternating projections method for convex feasibility problems; the problem is made amenable to the method by reducing it to a convex feasibility problem composed of a subspace and a cone via its homogeneous self-du...
متن کاملDistributionally Robust Optimization with Matrix Moment Constraints: Lagrange Duality and Cutting Plane Methods1
A key step in solving minimax distributionally robust optimization (DRO) problems is to reformulate the inner maximization w.r.t. probability measure as a semiinfinite programming problem through Lagrange dual. Slater type conditions have been widely used for zero dual gap when the ambiguity set is defined through moments. In this paper, we investigate effective ways for verifying the Slater ty...
متن کاملCutting Plane Algorithms for Integer Programming, Cutting Plane Algorithms
Cutting plane methods are exact algorithms for integer programming problems. They have proven to be very useful computationally in the last few years, especially when combined with a branch and bound algorithm in a branch and cut framework. These methods work by solving a sequence of linear programming relax-ations of the integer programming problem. The relaxations are gradually improved to gi...
متن کاملExploiting Robust Optimization for Interval Probabilistic Bisimulation
Verification of PCTL properties of MDPs with convex uncertainties has been investigated recently by Puggelli et al. However, model checking algorithms typically suffer from the state space explosion problem. In this paper, we discuss the use of probabilistic bisimulation to reduce the size of such an MDP while preserving the PCTL properties it satisfies. As a core part, we show that deciding bi...
متن کاملEfficient Maximum Margin Clustering via Cutting Plane Algorithm
Maximum margin clustering (MMC) is a recently proposed clustering method, which extends the theory of support vector machine to the unsupervised scenario and aims at finding the maximum margin hyperplane which separates the data from different classes. Traditionally, MMC is formulated as a non-convex integer programming problem and is thus difficult to solve. Several methods have been proposed ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ISCIE International Symposium on Stochastic Systems Theory and its Applications
سال: 2009
ISSN: 2188-4730,2188-4749
DOI: 10.5687/sss.2009.137